On the complexity of paths avoiding forbidden pairs
نویسندگان
چکیده
Given a graph G = (V,E), two fixed vertices s, t ∈ V and a set F of pairs of vertices (called forbidden pairs), the problem of a path avoiding forbidden pairs is to find a path from s to t that contains at most one vertex from each pair in F . The problem is known to be NP-complete in general and a few restricted versions of the problem are known to be in P. We study the complexity of the problem for directed acyclic graphs with respect to the structure of the forbidden
منابع مشابه
Complexity of the path avoiding forbidden pairs problem revisited
Let G = (V, E) be a directed acyclic graph with two distinguished vertices s, t, and let F be a set of forbidden pairs of vertices. We say that a path in G is safe, if it contains at most one vertex from each pair {u, v} ∈ F. Given G and F, the path avoiding forbidden pairs (PAFP) problem is to find a safe s–t path in G. We systematically study the complexity of different special cases of the P...
متن کاملFast Parallel Molecular Solution for Longest and Shortest Paths with Forbidden Pairs
Adleman demonstrate that we can deoxyribonucleic acid (DNA) strands to solve an instance of the Hamiltonian path problem (HPP). One year later, Lipton solved another NP hard problem. In this paper, we use this model for developing a new DNA algorithm to solve longest and shortest path with forbidden pairs. Our algorithm works in polynomial time.
متن کاملCOST Action IC1205 on Computational Social Choice: STSM Report
• Stable matchings with restricted edges. Our first objective was to tackle various problems involving restricted pairs defined by Dias et al. [1]. This problem extends the classical stable matching problem by providing three possible roles for every edge: forced, forbidden and regular. While optimal solutions must contain all forced edges, forbidden edges must be avoided. Dias et al. show that...
متن کاملA Dynamic Programming Algorithm for Finding Highest-Scoring Forbidden-Pairs Paths with Variable Vertex Scores
In the de novo peptide sequencing problem, output data from a mass spectrometer is used to determine the peptide whose fragmentation yielded that output. Candidate peptides are determined by finding forbidden-pairs paths in a spectrum graph constructed from the mass spectrometer data, assigning scores to vertices and/or edges in order to favor higher-scoring peptides. Chen et al. gave an algori...
متن کاملAn Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions
A graph with forbidden transitions is a pair (G,FG) where G := (VG, EG) is a graph and FG is a subset of the set {({y, x}, {x, z}) ∈ E G}. A path in a graph with forbidden transitions (G,FG) is a path in G such that each pair ({y, x}, {x, z}) of consecutive edges does not belong to FG. It is shown in [S. Szeider, Finding paths in graphs avoiding forbidden transitions, DAM 126] that the problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 157 شماره
صفحات -
تاریخ انتشار 2009